Distributed dynamic programming for discrete-time stochastic control, and idempotent algorithms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed dynamic programming for discrete-time stochastic control, and idempotent algorithms

Previously, idempotent methods have been found to be extremely fast for solution of dynamic programming equations associated with deterministic control problems. The original methods exploited the idempotent (e.g., max-plus) linearity of the associated semigroup operator. However, it is now known that the curse-of-dimensionality-free idempotent methods do not require this linearity. Instead, it...

متن کامل

Dynamic Programming Algorithms for Solving Stochastic Discrete Control Problems

The stochastic versions of classical discrete optimal control problems are formulated and studied. Approaches for solving the stochastic versions of optimal control problems based on concept of Markov processes and dynamic programming are suggested. Algorithms for solving the problems on stochastic networks using such approaches and time-expended network method are proposed. Mathematics subject...

متن کامل

Idempotent Expansions for Continuous-Time Stochastic Control

It is now well-known that many classes of deterministic control problems may be solved by max-plus or minplus (more generally, idempotent) numerical methods. These methods include max-plus basis-expansion approaches [1], [2], [6], [9], as well as the more recently developed curseof-dimensionality-free methods [9], [14]. It has recently been discovered that idempotent methods are applicable to s...

متن کامل

Idempotent Method for Continuous-Time Stochastic Control and Complexity Attenuation

We consider a min-plus based numerical method for solution of finite timehorizon control of nonlinear diffusion processes. The approach belongs to the class of curseof-dimensionality-free methods. The min-plus distributive property is required. The price to pay is a very heavy curse-of-complexity. These methods perform well due to the complexityattenuation step. This projects the solution down ...

متن کامل

Markov Decision Processes: Discrete Stochastic Dynamic Programming

The Wiley-Interscience Paperback Series consists of selected books that have been made more accessible to consumers in an effort to increase global appeal and general circulation. With these new unabridged softcover...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2011

ISSN: 0005-1098

DOI: 10.1016/j.automatica.2010.10.006